Virtual Private Network Design Under Traffic Uncertainty

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Virtual Private Network Design Under Traffic Uncertainty

We propose different formulations as well as efficient solution approaches for the VPN design problem under traffic uncertainty with symmetric bandwidths.

متن کامل

Provisioning virtual private networks under traffic uncertainty

We investigate a network design problem under traffic uncertainty which arises when provisioning Virtual Private Networks (VPNs): given a set of terminals that must communicate with one another, and a set of possible traffic matrices, sufficient capacity has to be reserved on the links of the large underlying public network so as to support all possible traffic matrices while minimizing the tot...

متن کامل

Dynamic bandwidth Reservation in Virtual Private Network under Uncertain Traffic

Abstract The aim of this paper is to analyze the dynamic evolution of a Virtual Private Network. The network is modeled as a system, controled by a manager who should take appropriate decisions. However, to be able to take the best possible decisions, the manager should also be able to forecast the worst behavior, in the sense of a quality of service criterion, of the system, he wants to contro...

متن کامل

A multi-period distribution network design model under demand uncertainty

Supply chain management is taken into account as an inseparable component in satisfying customers' requirements. This paper deals with the distribution network design (DND) problem which is a critical issue in achieving supply chain accomplishments. A capable DND can guarantee the success of the entire network performance. However, there are many factors that can cause fluctuations in input dat...

متن کامل

New Approaches for Virtual Private Network Design

Virtual private network design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent the amount of flow that a node can send to and receive from the network. The task is to reserve capacities at minimum cost and to specify paths between every ordered pair of nodes such that all valid traffic-matrices ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Discrete Mathematics

سال: 2004

ISSN: 1571-0653

DOI: 10.1016/j.endm.2004.03.007